Weierstrass condition for the general basic variational problem

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

A general descent framework for the monotone variational inequality problem

We present a framework for descent algorithms that solve the monotone variational inequality problem V IP v which consists in nding a solution v 2 v which satisses s(v) T (u?v) 0, for all u 2 v. This uniied framework includes, as special cases, some well known iterative methods and equivalent optimization formulations. A descent method is developed for an equivalent general optimization formula...

Determination of the Plastic Yield Condition as a Variational Problem.

The Euler and Weierstrass Conditions for Nonsmooth Variational Problems1

Necessary conditions are developed for a general problem in the calculus of variations in which the Lagrangian function, although finite, need not be Lipschitz continuous or convex in the velocity argument. For the first time in such a broadly nonsmooth, nonconvex setting, a full subgradient version of Euler’s equation is derived for an arc that furnishes a local minimum in the classical weak s...

Convergence of the multistage variational iteration method for solving a general system of ordinary differential equations

In this paper, the multistage variational iteration method is implemented to solve a general form of the system of first-order differential equations. The convergence of the proposed method is given. To illustrate the proposed method, it is applied to a model for HIV infection of CD4+ T cells and the numerical results are compared with those of a recently proposed method.